Search Step Size Control In Fast Evolutionary Programming
نویسندگان
چکیده
The second approach, called IFEP, to controlling search step size in FEP is to use both Cauchy mutation and Gaussian mutation. IFEP di ers from FEP slightly. Instead of using Cauchy mutation alone in FEP, IFEP generates two o spring from each parent, one by Cauchy mutation and the other by Gaussian mutation. The better one is then chosen as the o spring. The rest of the algorithm is exactly the same as FEP.
منابع مشابه
A Novel Experimental Analysis of the Minimum Cost Flow Problem
In the GA approach the parameters that influence its performance include population size, crossover rate and mutation rate. Genetic algorithms are suitable for traversing large search spaces since they can do this relatively fast and because the mutation operator diverts the method away from local optima, which will tend to become more common as the search space increases in size. GA’s are base...
متن کاملAn NLP Approach for Evolution of Heat Exchanger Networks Designed by Pinch Technology
Common methods to design heat exchanger networks (HENs) by pinch technology usually need an evolutionary step to reduce the number of heat transfer units. This step <span style="font-size: 10pt; color:...
متن کاملEvolutionary programming made faster
Evolutionary programming (EP) has been applied with success to many numerical and combinatorial optimization problems in recent years. EP has rather slow convergence rates, however, on some function optimization problems. In this paper, a “fast EP” (FEP) is proposed which uses a Cauchy instead of Gaussian mutation as the primary search operator. The relationship between FEP and classical EP (CE...
متن کاملA Stationary Point Convergence Theory for Evolutionary Algorithms
This paper deenes a class of evolutionary algorithms called evolutionary pattern search algorithms (EPSAs) and analyzes their convergence properties. This class of algorithms is closely related to evolutionary programming, evolution strategie and real-coded genetic algorithms. EPSAs are self-adapting evolutionary algorithms that modify the step size of the mutation operator in response to the s...
متن کاملA Fast and Self-Repairing Genetic Programming Designer for Logic Circuits
Usually, important parameters in the design and implementation of combinational logic circuits are the number of gates, transistors, and the levels used in the design of the circuit. In this regard, various evolutionary paradigms with different competency have recently been introduced. However, while being advantageous, evolutionary paradigms also have some limitations including: a) lack of con...
متن کامل